Derivation of algorithms for cutwidth and related graph layout parameters
نویسندگان
چکیده
In this paper, we investigate algorithms for some related graph parameters. Each of these asks for a linear ordering of the vertices of the graph (or can be formulated as such), and constructive linear time algorithms for the fixed parameter versions of the problems have been published for several of these. Examples are cutwidth, pathwidth, and directed or weighted variants of these. However, these algorithms have complicated technical details. This paper attempts to present ideas in these algorithms in a different more easily accessible manner, by showing that the algorithms can be obtained by a stepwise modification of a trivial hypothetical non-deterministic algorithm. The methodology is applied to rederive known results for the cutwidth and the pathwidth problem, and obtain similar new results for variants of these problems, like directed and weighted variants of cutwidth and modified cutwidth.
منابع مشابه
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
This paper investigates algorithms for some related graph parameters. Each asks for a linear ordering of the vertices of the graph (or can be formulated as such), and there are constructive linear time algorithms for the fixed parameter versions of the problems. Examples are cutwidth, pathwidth, and directed or weighted variants of these. However, these algorithms have complicated technical det...
متن کاملCutwidth I: A linear time fixed parameter algorithm
The cutwidth of a graph G is the smallest integer k such that the vertices of G can be arranged in a linear layout [v1, . . . , vn] in such a way that, for every i = 1, . . . , n− 1, there are at most k edges with one endpoint in {v1, . . . , vi} and the other in {vi+1, . . . , vn}. In this paper we provide, for any constant k, a linear time algorithm that for any input graph G, answers whether...
متن کاملExploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs
A simple digraph is semi-complete if for any two of its vertices u and v, at least one of the arcs (u, v) and (v, u) is present. We study the complexity of computing two layout parameters of semi-complete digraphs: cutwidth and optimal linear arrangement (Ola). We prove that: Both parameters are NP-hard to compute and the known exact and parameterized algorithms for them have essentially optima...
متن کاملGraph Layout Problems Parameterized by Vertex Cover
In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out to be fixed parameter tractable when parameterized by treewidth. However, Graph Layout problems are a notable exception. In particular, no fixed parameter tractable algorithms are known for the Cut...
متن کاملA constructive linear time algorithm for small cutwidth*y
The cutwidth of a graph G is deened to be the smallest integer k such that the vertices of G can be arranged in a linear layout v 1 ; : : : ; vn] in such a way that for every i = 1; : : : ; n?1, there are at most k edges with the one endpoint in fv 1 ; : : : ; v i g and the other in fv i+1 ; : : : ; vng. In this paper we show how to construct, for any constant k, a linear time algorithm that fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 75 شماره
صفحات -
تاریخ انتشار 2009